Review of ring perception algorithms for chemical graphs
نویسندگان
چکیده
(24) Kenknight, C. E. Acta Crystallogr. 1984, A40, 708-712. (25) Ghose, A. K.; Crippen, G. M. J . Comput. Chem. 1985, 6, 350-359. (26) Lejeune, J.; Michael, A,; Vercauteren, D. P. J . Comput. Chem. 1986, 7, 739-744. (27) Stouch, T. R.; Jurs, P. C. J . Chem. In$ Comput. Sci. 1986,26,4-12. (28) Hansch, C.; Leo, A. Substituent Constants for Correlation Analysis in Chemistry and Biology; Wiley: New York, 1979. (29) CRC Handbook of Chemistry and Physics, 65th ed.; Weast, R. C., Ed.; CRC: Boca Raton, FL, 1984. (30) Dictionary of Organophosphorus Compounds; Edmandson, R. S . , Ed.; Chapman and Hall: London, 1988. (31) Takeda, T.; Ohashi, Y.; Sasada, Y. Acta Crystallogr. 1970, 830, 825-827. (32) Miyashita, 0.; Kasahara, F.; Marumoto, R. J . Antibiot. 1985, 38, 981-986. (33) Pruisner, P.; Brennan, T.; Sundaralingam, M. Biochemistry 1973, 12,
منابع مشابه
On zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملNILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملNormalized Tenacity and Normalized Toughness of Graphs
In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters. Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Chemical Information and Computer Sciences
دوره 29 شماره
صفحات -
تاریخ انتشار 1989